圆柱体上均匀圆阵的阵增益分析

以环绕在圆柱体上的均匀圆阵为阵列模型,研究了圆阵在不同条件下的阵增益.从声传播理论出发,分析了平面波入射条件下阵列周围声场,得出了阵列常规处理增益和超增益的表达式.仿真结果表明,刚性圆柱体的存在增大了阵列的处理增益,当存在非刚性圆柱体时,通过合理设置菲刚性圆柱体的阻抗,可以在特定的频段内进一步提高阵列的增益,当圆阵与圆柱体之间存在空隙时,阵列处理增益会有所下降.     

航空发动机燃滑油附件后盖裂纹原因分析与预防对策

针对某型航空发动机燃-滑油附件后盖同部位成批次出现裂纹的问题,提出了裂纹故障引导转移的避障策略。通过研究裂纹产生的主要原因,分析后盖不同部位所产生的裂纹可能对航空发动机造成的危害程度,调整改变原支撑结构,在后盖非关键部位形成新的应力集中点,降低关键部位应力集中区的应力幅值,迫使故障从不可修复的关键部位转移到可修复的非关键部位。经计算机仿真,确定了裂纹引导缺口的最佳参数;同时,仿真结果表明,裂纹故障引导转移策略合理可行。     

监视雷达低仰角测角方法分析与工程实现

监视雷达天线孔径较小、垂直波束较宽,当雷达天线低仰角探测目标时,波束打地严重,测量易受多路径影响,仰角测量精度难以满足要求.先对现代雷达常用的和差比幅与比相两种测角方法进行了分析,然后以相控阵天线为例,对两者在低仰角下的测向精度进行了仿真和深入分析.最后结合两种方法的优缺点,对某Ⅰ型监视雷达样机进行改进,使其满足比幅比相混合型测角的条件,并对改进后的样机作动态对比试验,再次证明两种常用测角算法在低仰角下的优劣,为工程应用提供参考.     

运动模糊图像的运动模糊方向鉴别

曝光瞬间造成图像模糊的运动通常作为直线运动近似处理,若能找出模糊图像的运动模糊方向,并将之旋转到水平轴,则二维问题可简化为一维来处理,大大简化由模糊图像估计出运动模糊点扩散函数以及图像恢复的过程,并为图像恢复的并行计算创造有利条件。由于运动模糊降低了运动方向上图像的高频成分,沿着运动方向实施高通滤波(方向微分),可保证微分图像灰度值(绝对值)之和最小。基于此,本文利用双线性插值的方法,固定并适当选取方向微分的微元大小,构造出3×3方向微分乘子,得到了高效高精度的自动鉴别运动模糊方向的新方法,并通过数值实验进行了验证。     

水面舰艇攻势防御的效能评估及优势论证

进攻是最好的防守。针对水面舰艇攻势防御问题,对水面舰艇攻势防御的概念及使用前提进行了讨论,通过与守势防御的比较,从理论上对攻势防御的优势进行了论证。最后,根据论证结果、数据仿真及作战实际,给出了攻势防御的使用原则。     

面向空间应用的GaN功率器件及其辐射效应

研究氮化镓(GaN)功率器件及其辐射效应对于解决空间应用需求、促进新一代航天器建设具有重大意义。介绍了GaN功率器件的主要结构及工作原理,综述了近年来国内外在GaN功率器件的总剂量效应和单粒子效应两方面的研究进展,并对辐射效应在GaN功率器件中造成的退化和损伤机制进行分析与讨论。研究结果显示：GaN功率器件具有较强的抗总剂量能力,但是抗单粒子能力较弱,易发生漏电和单粒子烧毁,且烧毁点多发生在栅极边缘的漏侧。对GaN功率器件辐照损伤机理的研究缺乏权威理论,有待进一步探索,为其空间应用提供理论支撑。目前,平面结构的GaN功率器件是主流的技术方案,单片集成及高频小型化是GaN功率器件未来发展的方向。     

基于二进小波变换的噪声图像自适应增强新算法

针对图像增强算法通常会放大原图像中噪声分量的问题,提出了一种基于二进小波变换的图像增强新算法。该算法充分利用了二进小波变换的平移不变性和各尺度上小波系数间的相关性,有效改善了增强过程中噪声放大和边缘失真问题。此外,算法具有高度的自适应能力,适用性更强。实验结果表明,与目前已有的各类多尺度图像增强算法相比,该算法在抑制噪声和凸显图像特征两方面均有明显改进。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于复—方向小波变换和视觉表示的图像增强

针对复—方向小波变换具有好的平移不变性、方向选择性、对图像边缘特征的表示比传统实小波要好等优势,提出了一种基于视觉表示统计特性和复—方向小波变换的图像增强新方法。该算法在图像的多尺度复—方向小波变换域内进行动态范围(亮度)修正和局部对比度调整以增强图像。实验结果表明,与目前经典的多尺度增强算法相比,运用本文的算法增强的图像视觉效果好,在边缘和细节处失真小,而且对图像源的变化具有很好的鲁棒性。     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999